Revamping a Research Library Website from a Content Management Software to an Integrated Library Management Software

An advance in information and communication technology has challenged all the service sectors including libraries and information centres. Providing reliable information services through library websites that is easy and intuitive for the user is a major concern for the entire library professional. This work is a case study on the library website of the Indian Institute of Astrophysics. Formerly the library had Libsys 4.0 as the library automation software and presently it has been migrated to Koha 20.05. The study aims to explore the factors the institute takes into consideration for renovating the website. The new website of IIA Library is a visual example of an integrated library management system where all the spectrums of the library modules are brought down under a single platform designed in Koha. The study design is based on descriptive and exploratory analysis of the former and the later website. The case-study method of the study brings out the possible methods exercised in the process of data correction and migration from LibSys to Koha. For libraries and information centres or other similar institutes planning for a website migration, this case study can provide a point of initiation and culminate the important points required for the revamp

Rawlsian Allocation In Queueing And Sequencing Problem.

In this paper we analyze the implication of a particular kind of allocation rule called Rawlsian allocation rule on queueing and sequencing problems. We find that in case of queueing problems, Efficient allocation rules are Rawlsian but the converse is not true. For a particular class of Rawlsian allocation rule we characterize the unique class of transfer rule that ensures non-manipulability. Also in case of a situation where there is private information in multiple dimension, we find that a the particular kind of Rawlsian allocation rule equipped with a suitable transfer rule works as a panacea

Incentive and normative analysis on sequencing problem

In this paper we have analyzed sequencing problem from both incentive and normative aspects. We have identified unique class of VCG mechanisms that ensures egalitarian equivalence and we also have shown the possibility result with identical costs lower bound in that unique class of VCG mechanisms. Sequencing game imposes a stronger restriction on the possible set of “reference position”, compared to queuing game and that, in turn results into the failure of having a feasible VCG mechanism along with egalitarian equivalence. Although we found the necessary and sufficient condition for the above mentioned unique class of egalitarian equivalent VCG mechanism to satisfy identical costs lower bound when the number of participating agents is two, necessary condition for the same for more than two agents remains an open question. Lastly, we contemplate a situation where the restriction that sequencing problem imposes on “reference position” is overlooked, that is, we assume almost no restriction (except the fact that it must be positive) on reference waiting time and identify the class of VCG mechanism that is egalitarian equivalent

Incentive and normative analysis on sequencing problem

We identify the complete class of transfer rules that guarantee strategyproofness of any non-increasing in completion time allocation rule for the sequencing problem. We then characterize the class of mechanisms satisfying efficiency of decision (or aggregate cost minimization), egalitarian equivalence and strategyproofness. There is no mechanism in this class that satisfies either feasibility or weak group strategyproofness. Finally we identify the restrictions under which egalitarian equivalence, efficiency of decision, identical preference lower bound and strategyproofness are compatible

Rawlsian allocation in queueing and sequencing problem.

In this paper we analyze the implication of a particular kind of allocation rule called Rawlsian allocation rule on queueing and sequencing problems. We find that in case of queueing problems, Efficient allocation rules are Rawlsian but the converse is not true. For a particular class of Rawlsian allocation rule we characterize the unique class of transfer rule that ensures non-manipulability. Also in case of a situation where there is private information in multiple dimension, we find that a the particular kind of Rawlsian allocation rule equipped with a suitable transfer rule works as a panacea

Incentives and justice for sequencing problems.

We address the mechanism design issue for the sequencing problem. We identify the just sequencing rule that serves the agents in the non-increasing order of their waiting costs and prove that it is a Rawlsian rule. We identify all rVCG mechanisms that implement the just sequencing rule. The other properties of the just sequencing rule that we identify are the following. It is an affine cost minimizer. It can be implemented with budget balanced rVCG mechanisms. Finally, when waiting cost and processing time are private information, we identify all generalized rVCG mechanisms that ex-post implement the just sequencing rule

Bertrand-Cournot ranking reversal of the optimal privatization level

We consider a vertically related differentiated product mixed duopoly market where a public and private firm compete in the downstream market. The public firm is partially privatized and a welfare maximizing regulator chooses the privatization level. The production of the final commodity requires a key input that is supplied by a foreign monopolist who in the upstream market can practice either uniform or discriminatory pricing. We show that with uniform pricing regime the privatization is always larger under Cournot competition while in case of discriminatory pricing regime, the privatization level under Bertrand competition is always larger. We also find that under discriminatory pricing regime, the Cournot-Bertrand ranking of other relevant variables are sensitive to the degree of substitutability

Incentives and justice for sequencing problems.

We address the mechanism design issue for the sequencing problem. We identify the just sequencing rule that serves the agents in the non-increasing order of their waiting costs and prove that it is a Rawlsian rule. We identify all rVCG mechanisms that implement the just sequencing rule. The other properties of the just sequencing rule that we identify are the following. It is an affine cost minimizer. It can be implemented with budget balanced rVCG mechanisms. Finally, when waiting cost and processing time are private information, we identify all generalized rVCG mechanisms that ex-post implement the just sequencing rule

Reversal of Bertrand-Cournot Ranking for Optimal Privatization Level

We consider a vertically related differentiated product mixed duopoly market where a public and private firm compete in the downstream market. The public firm is partially privatized and a welfare maximizing regulator chooses the privatization level. The production of the final commodity requires a key input that is supplied by a foreign monopolist who in the upstream market can practice either uniform or discriminatory pricing. We show that with uniform pricing regime the privatization is always larger under Cournot competition while in case of discriminatory pricing regime, the privatization level under Bertrand competition is always larger. We also find that under discriminatory pricing regime, the Cournot-Bertrand ranking of other relevant variables are sensitive to the degree of substitutability